A Secure Chameleon Hash Function without Key Exposure from Pairings
نویسندگان
چکیده
Chameleon signatures are based on well established hash-and-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest, and becomes an important building block. The chameleon hash function is a trapdoor one-way hash function with some special properties, and plays an important role in constructing chameleon signature. In the paper, we propose a new chameleon hash scheme which enjoys some advantages of the previous schemes: collision-resistant, semantic security, and key-exposure freeness. At the same time, we show that the recipient’s trapdoor information will never be compromised under the assumption of q-SDH+CDH problem which is a new security assumption
منابع مشابه
Identity-based chameleon hashing and signatures without key exposure
The notion of chameleon hash function without key exposure plays an important role in designing secure chameleon signatures. However, all of the existing keyexposure free chameleon hash schemes are presented in the setting of certificatebased systems. In 2004, Ateniese and de Medeiros questioned whether there is an efficient construction for identity-based chameleon hashing without key exposure...
متن کاملKey-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems
Chameleon signatures simultaneously provide the properties of nonrepudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the problem of key exposure. This creates a strong disincentive for the recipient to forge signatures, partially undermining the concept of non-transferability. Recently, some specific constructions of...
متن کاملID-Based Chameleon Hashes from Bilinear Pairings
Chameleon hash function is a trapdoor one-way hash function. The IDbased chameleon hash function was first introduced by Ateniese and Medeiros [1]. As discussed by [1], the general advantages of ID-based cryptography over conventional cryptography with respect to key distribution are even more pronounced in a chameleon hashing scheme, because the owner of a public key does not necessarily need ...
متن کاملDiscrete logarithm based chameleon hashing and signatures without key exposure
Article history: Received 8 April 2010 Received in revised form 18 March 2011 Accepted 28 March 2011 Available online 6 May 2011 0045-7906/$ see front matter 2011 Elsevier Ltd doi:10.1016/j.compeleceng.2011.03.011 q Reviews processed and approved for publication ⇑ Corresponding author. E-mail address: [email protected] (X. Chen). Chameleon signatures simultaneously provide the properties of ...
متن کاملOn the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a chameleon hash that suffers from a key exposure problem: The non-transferability property requires willingness of the recipient in consequentially exposing a secret key, and therefore invalidating all signatures issued t...
متن کامل